CS–172 Computability & Complexity, FallMinimizing Finite Automata Given a DFA M , can we find an equivalent DFA (i.e., one that recognizes the same language as M ) with the minimum possible number of states? Thi

Source URL: www-inst.eecs.berkeley.edu

Safe Nondeterminism in a Deterministic-by-Default Parallel Language Robert L. Bocchino Jr.1 Stephen Heumann2 Nima Honarmand2 Sarita V. Adve2

Source URL: www.adamwelc.org

• Software engineering
• Computing
• Computer programming
• Concurrency control
• Transaction processing
• Complexity classes
• Java
• Functional languages
• Deterministic Parallel Java
• Determinism
• Deterministic algorithm
• Linearizability

Foreign Language Capabilities Your e-Discovery Partner Foreign Language Capabilities Increased Complexity

Source URL: www.techlawsolutions.com

On the topological complexity of weakly recognizable tree languages Jacques Duparc1 and Filip Murlak2? 1 Universit´e de Lausanne, Switzerland

Source URL: www.mimuw.edu.pl

• Mathematical logic
• Mathematics
• Omega language
• Tree
• Wadge hierarchy
• Determinacy
• Symbol
• Regular language
• Ω-automaton
• Automata theory
• Formal languages
• Theoretical computer science

The growth of functional complexity in speech Language is a complex system that is subject to the constant interactions of multiple components, including cortical and subcortical brain structures, and the external input

Source URL: www.mis.mpg.de

Microsoft Word - iccc12-final-submitted.docx

Source URL: boyangli.co

• Philosophy of language
• Artificial intelligence
• Computational creativity
• Conceptual blending
• Concept
• Object-oriented design
• Complexity
• Algorithm
• Projection
• Cognition
• Science
• Ethology

Investigations on Automata and Languages over a Unary Alphabet Giovanni Pighizzini Dipartimento di Informatica Università degli Studi di Milano, Italy

Source URL: pighizzini.di.unimi.it

• Applied mathematics
• Automata theory
• Algebraic structures
• Computational complexity theory
• Unary language
• Nested word
• Formal languages
• Mathematics
• Theoretical computer science

IEEE/ACM TRANSACTIONS ON AUDIO, SPEECH AND LANGUAGE PROCESSING, VOL. 22, NO. 12, DECEMBERSequential Complexity as a Descriptor for Musical Similarity

Source URL: matthiasmauch.de

• Feature
• K-nearest neighbor algorithm
• Prediction
• Principal component analysis
• Recommender system
• Cross-validation
• Statistics
• Computer vision
• Image processing

Memory Bounded Inference in Topic Models Ryan Gomes GOMES @ VISION . CALTECH . EDU Dept. of Computation and Neural Systems, California Institute of Technology, Pasadena, CAUSA Max Welling

Source URL: www.ics.uci.edu

• Estimation theory
• Expectation–maximization algorithm
• Missing data
• Mixture model
• Latent Dirichlet allocation
• Dirichlet process
• Time complexity
• Calculus of variations
• Statistics
• Theoretical computer science
• Statistical natural language processing

Path Logics for Querying Graphs: Combining Expressiveness and Efficiency Diego Figueira Leonid Libkin

Source URL: homepages.inf.ed.ac.uk

• Mathematics
• Applied mathematics
• FO
• Computational complexity theory
• Regular language
• Valuation
• Automata theory
• Formal languages
• Theoretical computer science